Source routing in networks with uncertainty: inference, sensitivity and path caching
نویسندگان
چکیده
In this paper we study source routing in an environment where imperfect state information is the norm. The uncertainty involved in several aspects of the routing process renders the route choices less than “optimal”. We start by conducting an experiment that compares the performance of an “inference”-based routing scheme to that of the traditional approach based on delayed link state broadcast. We then resort to a set of simple models to investigate to what extent the “crude” routing decisions based on limited statistical information conform to the ideal choices. In the conventional routing context, we identify a useful measure, the gap, which quantifies how successful a “crude” routing decision is likely to be. In the quality of service routing context we explore the possibility that a route choice based on limited statistical information is the “most likely” path to satisfy the user requirement. We also discuss the role of critical points, whose relative position affects the robustness of the routing decisions with respect to uncertain user requirement. Simulations establish the existence of gap and critical point in a realistic setup. The impacts of these observations on the effectiveness of a simple path caching scheme are then discussed.
منابع مشابه
Predictive Caching Strategy for On-Demand Routing Protocols in Wireless Ad Hoc Networks
Route caching strategy is important in on-demand routing protocols in wireless ad hoc networks. While high routing overhead usually has a significant performance impact in low bandwidth wireless networks, a good route caching strategy can reduce routing overheads by making use of the available route information more efficiently. In this paper, we first study the effects of two cache schemes, “l...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملMultipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملCache Timeout Strategies for on-Demand Routing in MANETs
Varying the route caching scheme can significantly change network performance for on-demand routing protocols in mobile ad hoc networks (MANETs). Initial route caching schemes retain paths or links until they are shown to be broken. However, stale routing information can degrade network performance with latency and extra routing overhead. Therefore, more recent caching schemes delete links at s...
متن کامل